One-to-one partial right translations of a right cancellative semigroup

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Left I-quotients of band of right cancellative monoids

Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element $qin Q$ can be written as $q=a^{-1}b$ for some $a,bin S$. If we insist on $a$ and $b$ being $er$-related in $Q$, then we say that $S$ is straight in $Q$. We characterize semigroups which are left I-quotients of left regular bands of right cancell...

متن کامل

One right too many.

For all too many years, few people gave much thought to the civil rights of hospitalized mental patients. More recently, fortunately, that situation has largely changed. The right to treatment, involuntary hospitalization, and 1I0W the right to refuse treatment, are among the issues which are predominant. The ofttimes delicate balance may not always be resolved in favor of the patient's needs, ...

متن کامل

One chance to get it right.

Recently I chaired a conference hosted by the National Council for Palliative Care focusing on the issues of comorbidity and dying with dignity. Being a conference chair is one sure way of concentrating your mind and thoughts on speaker presentations because you have to pick up the threads, link speakers together and summarise the conference.

متن کامل

Graph Products of Right Cancellative Monoids

Our first main result shows that a graph product of right cancellative monoids is itself right cancellative. If each of the component monoids satisfies the condition that the intersection of two principal left ideals is either principal or empty, then so does the graph product. Our second main result gives a presentation for the inverse hull of such a graph product. We then specialise to the ca...

متن کامل

One Right Does Make a Wrong

Algorithmic debugging is a semi-automatic method for locating bugs in programs. An algorithmic debugger asks a user a series of questions about the intended behaviour of the program. Here we present two new methods that reduces the number of questions a user must answer to locate a bug. First, we describe a heuristic based on comparing computations of the same program with different inputs. Bes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1976

ISSN: 0021-8693

DOI: 10.1016/0021-8693(76)90158-7